See Hadwiger number in All languages combined, or Wiktionary
{
"forms": [
{
"form": "Hadwiger numbers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Hadwiger number (plural Hadwiger numbers)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
}
],
"glosses": [
"For an undirected graph G: the size of the largest complete graph that can be obtained by contracting edges of G."
],
"id": "en-Hadwiger_number-en-noun-q97rP~7u",
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"complete graph",
"complete graph"
],
[
"contract",
"contract"
],
[
"edge",
"edge"
]
],
"raw_glosses": [
"(graph theory) For an undirected graph G: the size of the largest complete graph that can be obtained by contracting edges of G."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Hadwiger number"
}
{
"forms": [
{
"form": "Hadwiger numbers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Hadwiger number (plural Hadwiger numbers)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with non-redundant non-automated sortkeys",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"For an undirected graph G: the size of the largest complete graph that can be obtained by contracting edges of G."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"complete graph",
"complete graph"
],
[
"contract",
"contract"
],
[
"edge",
"edge"
]
],
"raw_glosses": [
"(graph theory) For an undirected graph G: the size of the largest complete graph that can be obtained by contracting edges of G."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Hadwiger number"
}
Download raw JSONL data for Hadwiger number meaning in English (1.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2026-10-21 from the enwiktionary dump dated 2026-10-01 using wiktextract (c1bb342 and 6f96ddf). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.